A 3/2-approximation algorithm for some minimum-cost graph problems
نویسندگان
چکیده
We consider a class of graph problems introduced in a paper of Goemans and Williamson that involve finding forests of minimum edge cost. This class includes a number of location/routing problems; it also includes a problem in which we are given as input a parameter k, and want to find a forest such that each component has at least k vertices. Goemans and Williamson gave a 2-approximation algorithm for this class of problems. We give an improved 2 -approximation algorithm.
منابع مشابه
-Approximation Algorithm for Some Minimum-Cost Graph Problems
In an ESA 2011 paper, Couëtoux [2] gives a beautiful 3 2 approximation algorithm for the problem of finding a minimum-cost set of edges such that each connected component has at least k vertices in it. The algorithm improved on previous 2-approximation algorithms for the problem. In this paper, we reanalyze Couëtoux’s algorithm using dualfitting and show how to generalize the algorithm to a bro...
متن کاملA Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems
We consider a class of graph problems introduced in a paper of Goemans and Williamson that involve finding forests of minimum edge cost. This class includes a number of location/routing problems; it also includes a problem in which we are given as input a parameter k, and want to find a forest such that each component has at least k vertices. Goemans and Williamson gave a 2-approximation algori...
متن کاملApproximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
In network activation problems we are given a directed or undirected graph G = (V,E) with a family {fuv (xu, xv) : (u, v) ∈ E} of monotone non-decreasing activation functions from D to {0, 1}, where D is a constant-size domain. The goal is to find activation values xv for all v ∈ V of minimum total cost ∑ v∈V xv such that the activated set of edges satisfies some connectivity requirements. Netw...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملImproved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph
In this paper we give improved approximation algorithms for some network design problems. In the Bounded-Diameter or Shallow-Light k-Steiner tree problem (SLkST), we are given an undirected graph G = (V,E) with terminals T ⊆ V containing a root r ∈ T , a cost function c : E → R, a length function l : E → R, a bound L > 0 and an integer k ≥ 1. The goal is to find a minimum c-cost r-rooted Steint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 150 شماره
صفحات -
تاریخ انتشار 2015